Load Balancing 2-Phased Geometrically Based Problems
نویسندگان
چکیده
A k-weighted graph is a directed graph where each vertex has k associated weights. Partitioning such a graph so that each weight is roughly evenly divided into each piece is useful for balancing a parallel task with k distinct components. Such a goal arises in crash simulation, in which there there are 2 components. We present a 2-weighted graph partitioning algorithm, based on the Ham Sandwich Theorem, for graphs embedded in 2-space. We demonstrate that this algorithm runs in linear expected time and yields a good partition in practice.
منابع مشابه
Load Balancing 2 - Phased Geometrically Based
A k-weighted graph is a directed graph where each vertex has k associated weights. Partitioning such a graph so that each weight is roughly evenly divided into each piece is useful for balancing a parallel task with k distinct components. Such a goal arises in crash simulation, in which there there are 2 components. We present a 2-weighted graph partitioning algorithm, based on the Ham Sandwich...
متن کاملOnline Distribution and Load Balancing Optimization Using the Robin Hood and Johnson Hybrid Algorithm
Proper planning of assembly lines is one of the production managers’ concerns at the tactical level so that it would be possible to use the machine capacity, reduce operating costs and deliver customer orders on time. The lack of an efficient method in balancing assembly line can create threatening problems for manufacturing organizations. The use of assembly line balancing methods cannot balan...
متن کاملAn Algorithm for Dynamic Load Balancing of Synchronous Monte Carlo Simulations on Multiprocessor Systems
We describe an algorithm for dynamic load balancing of geometrically parallelized synchronous Monte Carlo simulations of physical models. This algorithm is designed for a (heterogeneous) multiprocessor system of the MIMD type with distributed memory. The algorithm is based on a dynamic partitioning of the domain of the algorithm, taking into account the actual processor resources of the various...
متن کاملA BDDC Algorithm for Mortar Discretization of Elasticity Problems
Abstract. A BDDC (balancing domain decomposition by constraints) algorithm is developed for elasticity problems in three dimensions with mortar discretization on geometrically nonconforming subdomain partitions. Coarse basis functions in the BDDC algorithm are constructed from primal constraints on faces. These constrains are similar to the average matching condition and the moment matching con...
متن کاملLoad Balancing Using a Best-Path-Updating Information-Guided Ant Colony Optimization Algorithm
Abstract: Load balancing and phase balancing are important complement to reconfiguration of the feeder and the network.In the distribution automation ,these issues must be solved continuously and simultaneously to ensure the optimal performance of a distribution network.Distribution network imbalance has various consequences such as increase in power losses, voltage drop,cost increase,etc.In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999